AmbientDB: Relational Query Processing in a P2P Network
نویسندگان
چکیده
A new generation of applications running on a network of nodes, that share data on an ad-hoc basis, will benefit from data management services including powerful querying facilities. In this paper, we introduce the goals, assumptions and architecture of AmbientDB, a new peer-to-peer (P2P) DBMS prototype developed at CWI. Our focus is on the query processing facilities of AmbientDB, that are based on a three-level translation of a global query algebra into multiwave stream processing plans, distributed over an ad-hoc P2P network. We illustrate the usefulness of our system by outlining how it eases construction of a music player that generates intelligent playlists with collaborative filtering over distributed music logs. Finally, we show how the use of Distributed Hash Tables (DHT) at the basis of AmbientDB allows applications like the P2P music player to scale to large amounts of nodes.
منابع مشابه
AmbientDB: Complex Query Processing for P2P Networks
This paper describes the project AmbientDB done at CWI which is the focus of my PhD track. The goal of the AmbientDB project is to provide a data management platform for multiple devices interconnecting with each other in ad-hoc ways. The platform is intended to be a crucial building block to Ambient Intelligent (AmI) applications. In this paper I will give an overview of AmbientDB project and ...
متن کاملCoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. In the scenario of CoCache, a large number of peers, each of which may be attached with a local relational database and a...
متن کاملAnalyzing P2P Overlays with Recursive Queries
We explore the utility and execution of recursive queries as an interface for querying distributed network graph structures. To illustrate the power of recursive queries, we give several examples of computing structural properties of a P2P network such as reachability and resilience. To demonstrate the feasibility of our proposal, we sketch execution strategies for these queries using PIER, a P...
متن کاملEfficient Index-based Processing of Join Queries in DHTs
Massively distributed applications require the integration of heterogeneous data from multiple sources. Peer-to-peer (P2P) is one possible network model for these distributed applications and among P2P architectures, distributed hash table (DHT) is well known for its routing performance guarantees. Under a general distributed relational data model, join query operator, an essential component to...
متن کاملProcessing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networks which tackle efficient query distribution to a large set of peers but assume that each query can be answered completely at each peer. For queries which need data from more than one peer to be executed this is clear...
متن کامل